Verification of Probabilistic Programs

Verification of Probabilistic Programs

A general method for proving properties of probabilistic programs is presented, This method generalizes the intermediate assertion method in that it extends a given assertion on the output distribution into an invariant assertion on all intermediate distributions, too. The proof method is shown to be sound and complete for programs which terminate with probability 1. A dual approach, based on t...

On Automated Verification of Probabilistic Programs

We introduce a simple procedural probabilistic programming language which is suitable for coding a wide variety of randomised algorithms and protocols. This language is interpreted over finite datatypes and has a decidable equivalence problem. We have implemented an automated equivalence checker, which we call apex, for this language, based on game semantics. We illustrate our approach with thr...

Confidentiality for Probabilistic Multi-threaded Programs and Its Verification

Confidentiality is an important concern in today’s information society: electronic payment and personal data should be protected appropriately. This holds in particular for multi-threaded applications, which are generally seen the future of high-performance computing. Multithreading poses new challenges to data protection, in particular, data races may be exploited in security attacks. Also, th...

Runtime verification of programs using rule-based active system

Probabilistic Verification of Proofs

Recent research in the theory of computing has led to the following intriguing result. “There exists a probabilistic verifier for proofs of mathematical assertions that looks at a proof in only a constant number of bit positions and satisfies the following properties: (Completeness) For every valid theorem there exists a proof that is always accepted. (Soundness) For invalid assertions every pu...